Comparison of Simulated Annealing and Genetic Algorithm Approaches in Optimizing the Output of Biological Pathways

نویسندگان

  • RAJESH KRISHNAN
  • CARLA C. PURDY
چکیده

Biological processes are random in nature and studying them through laboratory experiments alone is costly and time-consuming. Applying mathematical modeling provides a more efficient method for understanding and modifying them. Recently we proposed an algorithm Box to assist in modeling and controlling any biological pathway. In the Box algorithm, the output (protein concentration) control and optimization is carried out by applying simulated annealing to selective high-sensitivity reactions. Here we apply an alternative approach, a genetic algorithm, in place of simulated annealing, in the Box algorithm. The improved Box algorithm compares outputs derived by simulated annealing with outputs derived by the genetic algorithm and chooses the better set of values. We thus provide a tool to guide the modification of biological pathways that is both accurate and easy to apply. We illustrate our technique using the TNFα-mediated NF-κB pathway. INTRODUCTION Modeling and control of biological pathways is of extreme importance for studying mutations (Kitano, 2002) and for synthetic biology (Andrianantoandro et al, 2006). Parameter extraction (Feng and Rabitz, 2004) and development of mathematical models of biological systems have increased the possibilities for modeling pathways and for controlling bio-chemical reactions to yield desired protein output concentrations. Optimization and control of biological pathways involves changing model parameters such as rate constants and species concentrations to achieve desired levels of the output protein within a specified time interval. Typically, control is achieved by either random lab experiments (Guet et al, 2002) or directed evolution (Yokobayashi et al, 2002). We wish to supplement wet lab experimentation with faster and cheaper computer simulation, greatly reducing the required number of wet lab experiments and guiding researchers to choose those wet lab experiments most likely to yield desired results. Treating biological pathways as computational problems and applying mathematical modeling provides an efficient method to study how to modify them (Voit, 2000). Previous approaches to modeling were strictly based on mathematical concepts and did not include experimental constraints (Li et al, 2002; JDesigner, 2006; JSim, 2006). We have designed our Box algorithm to incorporate experimental constraints, producing

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Comparison of Simulated Annealing, Genetic, and Tabu Search Algorithms for Fracture Network Modeling

The mathematical modeling of fracture networks is critical for the exploration and development of natural resources. Fractures can help the production of petroleum, water, and geothermal energy. They also greatly influence the drainage and production of methane gas from coal beds. Orientation and spatial distribution of fractures in rocks are important factors in controlling fluid flow. The obj...

متن کامل

Using and comparing metaheuristic algorithms for optimizing bidding strategy viewpoint of profit maximization of generators

With the formation of the competitive electricity markets in the world, optimization of bidding strategies has become one of the main discussions in studies related to market designing. Market design is challenged by multiple objectives that need to be satisfied. The solution of those multi-objective problems is searched often over the combined strategy space, and thus requires the simultaneous...

متن کامل

A New Hybrid Routing Algorithm based on Genetic Algorithm and Simulated Annealing for Vehicular Ad hoc Networks

In recent years, Vehicular Ad-hoc Networks (VANET) as an emerging technology have tried to reduce road damage and car accidents through intelligent traffic controlling. In these networks, the rapid movement of vehicles, topology dynamics, and the limitations of network resources engender critical challenges in the routing process. Therefore, providing a stable and reliable routing algorithm is ...

متن کامل

Genetic Algorithm and Simulated Annealing for Redundancy Allocation Problem with Cold-standby Strategy

This paper presents a new mathematical model for a redundancyallocation problem (RAP) withcold-standby redundancy strategy and multiple component choices.The applications of the proposed model arecommon in electrical power, transformation,telecommunication systems,etc.Manystudies have concentrated onone type of time-to-failure, butin thispaper, two components of time-to-failures which follow hy...

متن کامل

An Integrated Model of Project Scheduling and Material Ordering: A Hybrid Simulated Annealing and Genetic Algorithm

This study aims to deal with a more realistic combined problem of project scheduling and material ordering. The goal is to minimize the total material holding and ordering costs by determining the starting time of activities along with material ordering schedules subject to some constraints. The problem is first mathematically modelled. Then a hybrid simulated annealing and genetic algorithm is...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006